Parallel direct methods for solving banded linear systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Direct Parallel Algorithms for Banded Linear Systems

We investigate direct algorithms to solve linear banded systems of equations on MIMD multiprocessor computers with distributed memory. We show that it is hard to beat ordinary one-processor Gaussian elimination. Numerical computation results from the Intel Paragon are given.

متن کامل

Direct Parallel Algorithms for Banded

We investigate direct algorithms to solve linear banded systems of equations on MIMD multipro-cessor computers with distributed memory. We show that it is hard to beat ordinary one-processor Gaussian elimination. Numerical computation results from the Intel Paragon are given.

متن کامل

9. Parallel Methods for Solving Linear Equation Systems

9.1. Problem Setting .......................................................................................................................1 9.2. The Gauss Algorithm...............................................................................................................2 9.2.1. Sequential Algorithm..............................................................................................

متن کامل

A Simple Parallel Algorithm for Solving Banded Systems

In this paper we consider the problem of solving a banded system of linear equations. We present a simple algorithm. If the number of bands (or diagonals) is , then the work done is , where is the number of equations. This algorithm is easily parallelizable on various models. For example, when , the algorithm runs in time on an EREW PRAM using ! processors. When implemented on a cluster of " wo...

متن کامل

Gander A Survey of Direct Parallel Algorithms for Banded Linear Systems

We investigate direct algorithms to solve linear banded systems of equations on MIMD multiprocessor computers with distributed memory. We compare the coarse-grain parallel algorithms with ordinary one-processor Gaussian elimination. The parallel algorithms behave satisfactory only if the ratio of bandwidth and matrix order is very small. As a result of the high redundancy of the parallel algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1987

ISSN: 0024-3795

DOI: 10.1016/0024-3795(87)90128-5